An improved lower bound related to the Furstenberg-Sárközy theorem
نویسنده
چکیده
Let D(n) denote the cardinality of the largest subset of the set {1, 2, . . . , n} such that the difference of no pair of elements is a square. A well-known theorem of Furstenberg and Sárközy states that D(n) = o(n). In the other direction, Ruzsa has proven that D(n) & nγ for γ = 1 2 ( 1 + log 7 log 65 ) ≈ 0.733077. We improve this to γ = 1 2 ( 1 + log 12 log 205 ) ≈ 0.733412.
منابع مشابه
Bounding the Dimension of Points on a Line
We use Kolmogorov complexity methods to give a lower bound on the effective Hausdorff dimension of the point (x, ax+ b), given real numbers a, b, and x. We apply our main theorem to a problem in fractal geometry, giving an improved lower bound on the (classical) Hausdorff dimension of generalized sets of Furstenberg type.
متن کاملA New Proof of Sárközy’s Theorem
It is a striking and elegant fact (proved independently by Furstenberg and Sárközy) that in any subset of the natural numbers of positive upper density there necessarily exist two distinct elements whose difference is given by a perfect square. In this article we present a new and simple proof of this result by adapting an argument originally developed by Croot and Sisask to give a new proof of...
متن کاملOn the complexity of a family related to the Legendre symbol
Ahlswede, Khachatrian, Mauduit and A. Sárközy introduced the notion family-complexity of families of binary sequences. They estimated the family-complexity of a large family related to Legendre symbol introduced by Goubin, Mauduit and Sárközy. Here their result is improved, and apart from the constant factor the best lower bound is given for the family-complexity. 2000 AMS Mathematics Subject C...
متن کاملOn Complex Positive Definite Functions on Zn Vanishing on Squares
We generalize the Sárközy-Furstenberg theorem on squares in difference sets of integers, and show that, given any positive definite function f : ZN → C with density at least ρ(N), where ρ(N) = O((logN) ), there is a perfect square σ ≤ N/2 such that f(σ) is non-zero. We do not rely on the usual analysis of the dichotomy of randomness and periodicity of a set and iterative application of the Hard...
متن کاملPolynomial Configurations in Subsets of Random and Pseudo-random Sets
N , which are analogous to the quantitative version of the wellknown Furstenberg-Sárközy theorem due to Balog, Pintz, Pelikán, and Szemerédi. In the dense case, Balog et al showed that there is a constant C > 0 such that for all integer k 2 any subset of the first N integers of density at least C(logN) 1 4 log log log logN contains a configuration of the form {x, x+ d} for some integer d > 0. L...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 22 شماره
صفحات -
تاریخ انتشار 2015